WORST CASE BOUNDS FOR THE EUCLIDEAN MATCHING PROBLEM-t
نویسنده
چکیده
It is shown how the classical mathematical theory of sphere packing can be used to obtain bounds for a greedy heuristic for the bounded euclidean matching problem. In the case of 2 dimensions, bounds are obtained directly. For higher dimensions, an appeal is made to known bounds for the sphere packing problem that have appeared in the mathematical literature.
منابع مشابه
A survey of heuristics for the weighted matching problem
This survey paper reviews results on heuristics for two weighted matching problems: matchings where the vertices are points in the plane and weights are Euclidean distances, and the assignment problem. Several heuristics are described in detail-and results are given for worst-case ratio bounds, absolute bounds, and expected bounds. Applications to practical problems and some mathematical comple...
متن کاملDynamic Approximate Matchings with an Optimal Recourse Bound
In the area of dynamic matching algorithms, the number of changes to the matching per update step, also known as the recourse bound, is an important measure of quality, Nevertheless, the worstcase recourse bounds of almost all known dynamic approximate matching algorithms are prohibitively large, significantly larger than the corresponding update times. In this paper we fill in this gap via a s...
متن کاملOn Minimum Stars and Maximum Matchings
We discuss worst-case bounds on the ratio of maximum matching and minimum median values for finite point sets. In particular, we consider “minimum stars,” which are defined by a center chosen from the given point set, such that the total geometric distance L S to all the points in the set is minimized. If the center point is not required to be an element of the set (i.e., the center may be a St...
متن کاملApproximate Geometric Pattern Matching Under Rigid Motions
We present techniques for matching point-sets in two and three dimensions under rigid-body transformations. We prove bounds on the worst-case performance of these algorithms to be within a small constant factor of optimal, and conduct experiments to show that the average performance of these matching algorithms is often better than that predicted by the worst-case bounds.
متن کاملMin-weight double-tree shortcutting for Metric TSP: Bounding the approximation ratio
The Metric Traveling Salesman Problem (TSP) is a classical NP-hard optimization problem. The double-tree shortcutting method for Metric TSP yields an exponentially-sized space of TSP tours, each of which approximates the optimal solution within at most a factor of 2. We consider the problem of finding among these tours the one that gives the closest approximation, i.e. the minimum-weight double...
متن کامل